package leetcode.problems;

/**
 * Created by Administrator on 2018/3/22.
 */
public class _0321test {
    /*674. Longest Continuous Increasing Subsequence
    Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).
    Example 1:
    Input: [1,3,5,4,7]
    Output: 3
    Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3.
    Even though [1,3,5,7] is also an increasing subsequence, it's not a continuous one where 5 and 7 are separated by 4.
    Example 2:
    Input: [2,2,2,2,2]
    Output: 1
    Explanation: The longest continuous increasing subsequence is [2], its length is 1.
    Note: Length of the array will not exceed 10,000.

    最长连续递增序列
    给定一个无序的整数数组，找出最长的连续递增子序列的长度（子序列）。
    例1：
    输入：[ 1,3,5,4,7 ]
    输出：3
    说明：最长递增子序列[1,3,5v]是连续的，其长度为3。
    虽然[ 1、3、5、7 ]也是一个递增子序列，它不是连续,5和7中间插了4。
    例2：
    输入：[ 2,2,2,2,2 ]
    输出：1
    说明：最长连续递增子序列为[ 2 ]，其长度为1。

    注意：数组的长度不会超过10000。*/
    public int findLengthOfLCIS(int[] nums) {
        int res = 0, cnt = 0;
        for(int i = 0; i < nums.length; i++){
            if(i == 0 || nums[i-1] < nums[i]) res = Math.max(res, ++cnt);
            else cnt = 1;
        }
        return res;
    }
}
